Symmetry in Generating Functions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetry in Generating Functions

Generating functions play important roles in theory of orthogonal polynomials. In particular, it is important to consider generating functions that have symmetry. This paper is a survey on generating functions that define unitary operators. First, classical generating functions that define unitary operators are discussed. Next, group theoretical approach to generating functions that have unitar...

متن کامل

On composition of generating functions

In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...

متن کامل

GENERATING FUNCTIONS FOR HOPF BIFURCATION WITH Sn-SYMMETRY

Hopf bifurcation in the presence of the symmetric group Sn (acting naturally by permutation of coordinates) is a problem with relevance to coupled oscillatory systems. To study this bifurcation it is important to construct the Taylor expansion of the equivariant vector field in normal form. We derive generating functions for the numbers of linearly independent invariants and equivariants of any...

متن کامل

Tutte polynomials of wheels via generating functions

We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.

متن کامل

Probability Generating Functions for Sattolo’s Algorithm

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2010

ISSN: 2073-8994

DOI: 10.3390/sym2010345